On Kirchberg's embedding problem

On Kirchberg’s embedding problem

A C* algebra is a closed self-adjoint subalgebra of B(H), the bounded operators on a Hilbert space H. Kirchberg asked whether every C* algebra embeds into an ultrapower of a particular C* algebra, the Cuntz algebra O_2. In this talk, I will explain the model-theoretic content of this problem. In particular, I will show how model-theoretic forcing can be used to give a weak local reformulation o...

On the Embedding Problem For

The computable embedding problem

Calvert [3], [4], [5] calculated the complexity of the computable isomorphism problem for a number of familiar classes of structures. Rosendal suggested that it might be interesting to do the same for the computable embedding problem. By “computable isomorphism problem”and “computable embedding problem”we mean the di¢ culty of determining whether there exists an isomorphism (embedding) between ...

The Stable Embedding Problem

We compute a stable polynomial matrix embedding a stabilizable one. The algorithm resembles the one described by Beelen and Van Dooren for the unimodular embedding problem. We also desribe the numerical problems associated with this kind of algorithms, and point out why the stable embedding algorithm has better prospects than its unimodular counterpart.

Connes ’ embedding problem and Tsirelson ’ s problem

We show that Tsirelson’s problem concerning the set of quantum correlations and Connes’ embedding problem on finite approximations in von Neumann algebras (known to be equivalent to Kirchberg’s QWEP conjecture) are essentially equivalent. Specifically, Tsirelson’s problem asks whether the set of bipartite quantum correlations generated between tensor product separated systems is the same as the...